A NEW LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF BOOLEAN SUMSWEGENER I.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 2; PP. 109-114; BIBL. 7 REF.Article

BEST POSSIBLE ASYMPTOTIC BOUNDS ON THE DEPTH OF MONOTONE FUNCTIONS IN MULTIVALUED LOGICWEGENER I.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 81-83; BIBL. 3 REF.Article

BOOLEAN FUNCTIONS WHOSE MONOTONE COMPLEXITY IS OF SIZE N²/LOG NWEGENER I.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 2; PP. 213-224; BIBL. 14 REF.Article

THE CONSTRUCTION OF AN OPTIMAL DISTRIBUTION OF SEARCH EFFORTWEGENER I.1981; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 4; PP. 533-543; BIBL. 9 REF.Article

A COUNTEREXAMPLE TO A CONJECTURE OF SCHNORR REFERRING TO MONOTONE NETWORKSWEGENER I.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 147-150; BIBL. 2 REF.Article

RELATING MONOTONE FORMULA SIZE AND MONOTONE DEPTH OF BOOLEAN FUNCTIONSWEGENER I.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 1; PP. 41-42; BIBL. 3 REF.Article

AN IMPROVED COMPLEXITY HIERARCHY ON THE DEPTH OF BOOLEAN FUNCTIONSWEGENER I.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 2; PP. 147-152; BIBL. 3 REF.Article

BOOLEAN FUNCTIONS WHOSE MONOTONE COMPLEXITY IS OF SIZE N²/LOG NWEGENER I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 22-31; BIBL. 11 REF.Conference Paper

THE DISCRETE SEQUENTIAL SEARCH PROBLEM WITH NONRANDOM COST AND OVERLOOK PROBABILITIESWEGENER I.1980; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1980; VOL. 5; NO 3; PP. 373-380; BIBL. 6 REF.Article

SWITCHING FUNCTIONS WHOSE MONOTONE COMPLEXITY IS NEARLY QUADRATICWEGENER I.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 83-97; BIBL. 7 REF.Article

ON SEPARATING SYSTEMS WHOSE ELEMENTS ARE SETS OF AT MOST K ELEMENTSWEGENER I.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 2; PP. 219-222; BIBL. 1 REF.Article

On the complexity of encoding in analog circuitsWEGENER, I.Information processing letters. 1996, Vol 60, Num 1, pp 49-52, issn 0020-0190Article

The complexity of the parity function in unbounded fan-in, unbounded depth circuitsWEGENER, I.Theoretical computer science. 1991, Vol 85, Num 1, pp 155-170, issn 0304-3975, 16 p.Article

Efficient simulation of circuits by EREW PRAMsWEGENER, I.Information processing letters. 1990, Vol 35, Num 2, pp 99-102, issn 0020-0190Article

DISCRETE SEQUENTIAL SEARCH WITH POSITIVE SWITCH COST = RECHERCHE SEQUENTIELLE DISCRETE AVEC UN COUT DE COMMUTATION POSITIFLOESSNER U; WEGENER I.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 3; PP. 426-440; BIBL. 11 REF.Article

Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functionsWEGENER, I.Information processing letters. 1993, Vol 46, Num 2, pp 85-87, issn 0020-0190Article

The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n+1.1nWEGENER, I.Information and computation (Print). 1992, Vol 97, Num 1, pp 86-96, issn 0890-5401Article

More on the complexity of slice functionsWEGENER, I.Theoretical computer science. 1986, Vol 43, Num 2-3, pp 201-211, issn 0304-3975Article

Time-space trade-offs for branching programsWEGENER, I.Journal of computer and system sciences (Print). 1986, Vol 32, Num 1, pp 91-96, issn 0022-0000Article

On the complexity of slice functionsWEGENER, I.Theoretical computer science. 1985, Vol 38, Num 1, pp 55-68, issn 0304-3975Article

Optimal search with positive switch cost is NP-hardWEGENER, I.Information processing letters. 1985, Vol 21, Num 1, pp 49-52, issn 0020-0190Article

A simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantlyWEGENER, I.Computer journal (Print). 1993, Vol 36, Num 3, pp 286-288, issn 0010-4620Article

The critical complexity of all (monotone) boolean functions and monotone graph propertiesWEGENER, I.Information and control. 1985, Vol 67, Num 1-3, pp 212-227, issn 0019-9958Article

Optimal decision trees and one-time-only branching programs for symmetric Boolean functionsWEGENER, I.Information and control. 1984, Vol 62, Num 2-3, pp 129-143, issn 0019-9958Article

On the complexity of branching programs and decision trees for clique functionsWEGENER, I.Journal of the Association for Computing Machinery. 1988, Vol 35, Num 2, pp 461-471, issn 0004-5411Article